Sharp upper bounds on the number of resonances near the real axis for trapped systems
نویسنده
چکیده
This paper is devoted to a detailed study of the behavior of the resonances and resonant states near the real axis. We work mainly in the semi-classical setting but most results can be easily translated into the classical one. By resonances near the real axis we mean resonances in a “box” Ω(h) = [a0, b0] + i[−S(h), 0], where 0 < S(h) = O(h), K ≫ 1. Such resonances may exist only for trapping geometries. We accept the convention here that resonances lie in the lower half-plane. For simplicity, we consider compact perturbation P (h) of the Laplacian only. The basic properties are established in the abstract “black box scattering” setting introduced by Sjöstrand and Zworski [SjZ] (see next section). It is well known that if z(h) is a resonance, then there exists a z(h)-outgoing resonant state u(h) satisfying the equation (P (h)− z(h))u(h) = 0. By [B1], [St3], if −Im z = O(h), then
منابع مشابه
Quantum and classical resonances for strongly trapping systems
Resonances are one of the most studied objects in physics, and in quantum mechanics they describe states which in addition to a rest energy have a rate of decay. A mathematical example is given by the zeros of the Riemann zeta function which are the resonances of the quantum Hamiltonian given by the Laplacian on the modular surface. The term "resonance" comes from the analogy with "a bell sound...
متن کاملQuantized open chaotic systems
Two different “wave chaotic” systems, involving complex eigenvalues or resonances, can be analyzed using common semiclassical methods. In particular, one obtains fractal Weyl upper bounds for the density of resonances/eigenvalues near the real axis, and a classical dynamical criterion for a spectral gap.
متن کاملSharp Bounds on the PI Spectral Radius
In this paper some upper and lower bounds for the greatest eigenvalues of the PI and vertex PI matrices of a graph G are obtained. Those graphs for which these bounds are best possible are characterized.
متن کاملSharp Upper bounds for Multiplicative Version of Degree Distance and Multiplicative Version of Gutman Index of Some Products of Graphs
In $1994,$ degree distance of a graph was introduced by Dobrynin, Kochetova and Gutman. And Gutman proposed the Gutman index of a graph in $1994.$ In this paper, we introduce the concepts of multiplicative version of degree distance and the multiplicative version of Gutman index of a graph. We find the sharp upper bound for the multiplicative version of degree distance and multiplicative ver...
متن کاملQuasimodes and Resonances: Sharp Lower Bounds
We prove that, asymptotically, any cluster of quasimodes close to each other approximates at least the same number of resonances, counting multiplicities. As a consequence, we get that the counting function of the number of resonances close to the real axis is bounded from below essentially by the counting function of the quasimodes.
متن کامل